Weak Partition Properties for Infinite Cardinals. I

نویسنده

  • E. M. KLEINBERG
چکیده

Partition properties are perhaps the most fruitful of the various methods for defining and discussing large cardinals in set theory. In this paper we weaken in a natural way the most well known of these partition properties and examine the extent to which the cardinals defined remain "large." 1. 1.1. An area of set theory which has come under a great deal of study recently is that concerned with partition properties for cardinal numbers. In order to consider several specific examples let k denote an uncountable cardinal and let us introduce k—*(k)2 (k—*(k)(k)(k)<¡°, then there exists a nonconstructible A3 set of integers. R3 If k—>(k)2, then k is a strongly inaccessible cardinal. R4 For X an infinite cardinal less than k, let k—>(k)1 (k—*ík)\") denote the assertion (*) changed to cover partitions into X pieces. Then for each infinite cardinal X less than k, k—>(k)x («-»Wx"") is equivalent to k—*(k)2 (k—>(k)(k)2 and k—»(/t)(k)1 states that there exists a set x of cardinality k all of whose 2 element subsets are contained in only one of the pieces— what if we just assert that there exists a subset x of k of cardinality k all of whose 2 element subsets are contained in fewer than X of the pieces? We make this notion precise by introducing k^>(k)2 (kAOO^) to denote for each infinite cardinal X less than k and partition of the 2 Received by the editors March 13, 1968 and, in revised form, January 24, 1970. AMS 1970 subject classifications. Primary 02K35.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Calculus of Partition Sequences, Changing Cofinalities, and a Question of Woodin

We study in this paper polarized infinite exponent partition relations. We apply our results to constructing a model for the theory “ZF+DC+ω1 is the only regular, uncountable cardinal ≤ ωω1+1.” This gives a partial answer to a question of Woodin. In 1994, J. Steel proved what had long been suspected: that assuming AD, the regular cardinals of L(R) below Θ are all measurable, where Θ is the leas...

متن کامل

Unfriendly partitions of a graph

It has been conjectured by Cowan and Emerson [3] that every graph has an unfriendly partition; i.e., there is a partition of the vertex set V= V, v V, such that every vertex of V, is joined to at least as many vertices in V, _, as to vertices in V,. It is easily seen that every rinite graph has such a partition, and hence by compactness so does any locally finite graph. We show that the conject...

متن کامل

Making All Cardinals Almost Ramsey ∗ † ‡ Arthur

We examine combinatorial aspects and consistency strength properties of almost Ramsey cardinals. Without the Axiom of Choice, successor cardinals may be almost Ramsey. From fairly mild supercompactness assumptions, we construct a model of ZF + ¬ACω in which every infinite cardinal is almost Ramsey. Core model arguments show that strong assumptions are necessary. Without successors of singular c...

متن کامل

Jonsson-like partition relations and j: V -> V

Working in the theory “ZF + There is a nontrivial elementary embedding j : V → V ”, we show that a final segment of cardinals satisfies certain square bracket finite and infinite exponent partition relations. As a corollary to this, we show that this final segment is composed of Jonsson cardinals. We then show how to force and bring this situation down to small alephs. A prototypical result is ...

متن کامل

A class of strong diamond principles

In the context of large cardinals, the classical diamond principle 3κ is easily strengthened in natural ways. When κ is a measurable cardinal, for example, one might ask that a 3κ sequence anticipate every subset of κ not merely on a stationary set, but on a set of normal measure one. This is equivalent to the existence of a function ` ... κ → Vκ such that for any A ∈ H(κ) there is an embedding...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010